Levinson-type extensions for non-Toeplitz systems - Signal Processing, IEEE Transactions on

نویسندگان

  • Milton Porsani
  • Tad J. Ulrych
چکیده

We show that Levinson's basic principle for the solution of normal equations which are of Toeplitz form may he extended to the case where these equations do not possess this specific symmetry. The use of Levinson's principle allows us to obtain a compact ( 2 x 2 ) form to express a system of equations of arbitrary order. This compact form is the key expression in the development of recursive algorithms and allows a compact representation of the most important Levinsontype algorithms which are used in the analysis of seismic and time series data in general. In the case when the coefficient matrix does not possess any type of special structure, the number of multiplications and divisions required in the inversion is n3 2n2 + 4n. We illustrate the described method by application to various examples which we have chosen so that the coefficient matrix possesses various symmetries. Specifically, we first consider the solution of the normal equations when the associated matrix is the doubly symmetric non-Toeplitz covariance matrix. Second, we obtain the solution of extended Yule-Walker equations where the coefficient matrix is Toeplitz but nonsymmetric. Finally, we briefly illustrate the approach by considering the determination of the prediction error operator when the NE are in fact of symmetric Toeplitz form.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete fast algorithms for two-dimensional linear prediction on a polar raster

New generalized split Levinson and Schur algorithms for the two-dimensional linear least squares prediction problem on a polar raster are derived. The algorithms compute the prediction filter for estimating a random field at the edge of a disk, from noisy observations inside the disk. The covariance function of the random field is assumed to have a Toeplitzplus-Hankel structure for both its rad...

متن کامل

Fast algorithms for linear least squares smoothing problems in one and two dimensions using generalized discrete Bellman-Siegert-Krein resolvent identities

New fast algorithms for linear least squares smoothing problems in one and two dimensions are derived. These are discrete Manuscript received November 9, 1989; revised March 23, 1991. This work was supported by the Air Force Office of Scientific Research under grant AFOSR-89-0017. The authors are with the Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arb...

متن کامل

A Schur–based algorithm for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of symmetric positive definite Toeplitz matrices. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...

متن کامل

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...

متن کامل

Fast Algorithms for Toeplitz and Hankel Matrices

The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004